| 翻訳と辞書 |
| list of complexity classes ： ウィキペディア英語版 |
list of complexity classes
This is a list of complexity classes in computational complexity theory. For other computational and complexity subjects, see list of computability and complexity topics.
Many of these classes have a 'co' partner which consists of the complements of all languages in the original class. For example if a language L is in NP then the complement of L is in co-NP. (This doesn't mean that the complement of NP is co-NP - there are languages which are known to be in both, and other languages which are known to be in neither.)
"The hardest problems" of a class refer to problems, which belong to the class and every other problem of that class can be reduced to it. Furthermore, the reduction is also a problem of the given class, or its subset.
If you don't see a class listed (such as co-UP) you should look under its partner (such as UP).
== References ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「list of complexity classes」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|